|
|
Vertex and Pixel Shaders for 3D Visualization of grass
Dokoupil, Martin ; Chudý, Peter (referee) ; Kršek, Přemysl (advisor)
This thesis describes the way to create three-dimensional visualization of grass in computer graphic. Contains progress of grass visualization from past to present. Contains shader intro and its use for visualization. Text mention scene graph which has been used for implementation. Text describes three levels of detail and implemetation of waving grass. Text compares frame speed for each level of grass and frame speed for complete visualized grass.
|
|
|
The making of 3D electronics catalogs
Spousta, Martin ; Dvořák,, Jiří (referee) ; Dvořák, Jiří (advisor)
This Bachelor thesis deals with problems of making 3D electronics catalogues for their widely usage. It contains the description of current level of electronics catalogues, theoretical solution of the problem with description of advantages, disadvantages and warrant of new solution. It contains the practical solution as well.
|
|
|
GLSL Based Engine
Šlesár, Michal ; Karas, Matej (referee) ; Milet, Tomáš (advisor)
Creating a graphical application running on a GPU typically involves configuring the GPU, creating and configuring the required objects, and then implementing the application's behavior itself. The aim of this work is to create a tool that would automate this configuration using the OpenGL application interface. As a result, the user would not have to waste time configuring and could quickly create and prototype graphics applications. In addition, the created tool adds new functionality to the application that is not native or supported on the GPU, such as working with a mouse and keyboard.
|
|
|
Universal Graphic Editor Library and Python Module
Košulič, Jaroslav ; Kočí, Radek (referee) ; Smrčka, Aleš (advisor)
The diagrams, schemes, and graphs in general are widely used in the field of easy-to-read information visualisation. We use them for example in the school lessons for an algorithm presentation, or in the technical jobs such as software and hardware development by modelling UML diagrams, database schemes, etc. The project Universal Graph Editor has been established two years ago to fill the gap with the software tool providing such a modelling engine. The previous work has been reasumed in semestral project by design of the dynamic graph drawing (or the drawing of a vector graphic in general) and the library for graph manipulation with C-language interface. This master thesis continues further by creating a Python module using the developed interface. The documentation and the testing phase is conluding the annual work.
|
|
|
Hierarchical Techniques in Lighting Computation
Ligmajer, Jiří ; Polok, Lukáš (referee) ; Navrátil, Jan (advisor)
This master thesis deals with description of hierarchical techniques in global lighting computation. Here is explaining the importance of hierarchical techniques in lighting computation and shows method, how to use these hierarchical techniques in realtime radiosity and its extension to dynamic area lighting. These two techniques are described in detail in the first part of this project. In the other part is desing and implementation of application for dynamic area lighting computation.
|
|
|
3D Triangles Polygonal Mesh Conversion on 3D Spline Surfaces
Jahn, Zdeněk ; Šiler, Ondřej (referee) ; Kršek, Přemysl (advisor)
In computer graphics we can handle unstructured triangular 3D meshes which are not too usable for processing through their irregularity. In these situations it occurs need of conversion that 3D mesh to more suitable representation. Some kind of 3D spline surface can be proper alternative because it institutes regularity in the form of control points grid and that's why it is more suitable for next processing. During conversion, which is described in this thesis, quadrilateral 3D mesh is constructed at first. This mesh has regular structure but mainly the structure corresponds to structure of control points grid of resulting 3D spline surface. Created quadrilateral 3D mesh can be saved and consequently used in specific modeling applications for T-spline surface creation.
|
|
|
Polygonal Models Smoothing
Nečas, Ondřej ; Herout, Adam (referee) ; Kršek, Přemysl (advisor)
The result of digitalization 3d surface is affected by many factors. After digitalization can on the surface emerge some unwanted artefacts. The differences from original are caused by resolution of the device or its limited precision. For elimination of this artefact exists many smoothing algorithms, but we want to choose that which best suits this purpose. So it is useful to know their limits and characteristics.
|
|
|
The Walkthrough Aplication in Large 3D Terrain
Panáček, Petr ; Mikolov, Tomáš (referee) ; Bartoň, Radek (advisor)
Rendering of large terrain is common problem in 3D computer graphics. Even if we have high-tech hardware equipment today, there is still a lot of high computational demand. Therefore new algorithms are developed. These algorithms include level of detail rendering and culling objects in dependence on view of camera. This bachelor thesis describes one of these algorithms and its modifications. Part of the problem is also creation of tiles hierarchy for these algorithms. Result of the thesis is application implemented in OpenSceneGraph.
|
|
|
Performance Evaluation of Graphics Accelerator
Dvořák, Milan ; Šolony, Marek (referee) ; Jošth, Radovan (advisor)
This bachelor thesis deals with a performance evaluation of graphics accelerators. Properties of the current graphics accelerators and existing solutions for evaluating their performance are summarized. An own methodology for performance evaluation is proposed and the implementation of an OpenGL aplication with GLUT and GLEW libraries is described. In the last part, several graphic cards are tested, the influence of various factors is examined, and the measured results are discussed.
|
|
|
Graphics Graph Representation
Matula, Radek ; Goldefus, Filip (referee) ; Masopust, Tomáš (advisor)
This Master Thesis deals with the drawing algorithms of graphs known from the mathematical theory. These algorithms deals with an appropriate distribution of the graph vertices in order to obtain the most clear and readable graphs for human readers. The main objective of this work was also to implement the drawing algorithm in the application that would allow to edit the graph. This work deals also with graphs representation in computers.
|
guest ::
